Optimal algorithms for a problem of optimal control

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An optimal control problem for a engineering system

In this article, we apply this new method for solving an engineering systemwith initial and boundary conditions and integral criterion ,and we will usingdynamic programming as iteration for solving model.

متن کامل

A New Optimal Solution Concept for Fuzzy Optimal Control Problems

In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...

متن کامل

Optimal Control for Descriptor Systems: Tracking Problem (RESEARCH NOTE)

Singular systems have been studied extensively during the last two decades due Abstract to their many practical applications. Such systems possess numerous properties not shared by the well-known state variable systems. This paper considers the linear tracking problem for the continuous-time singular systems. The Hamilton-Jacobi theory is used in order to compute the optimal control and associa...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1989

ISSN: 0885-064X

DOI: 10.1016/0885-064x(89)90002-2